A Personified Annealing Algorithm for Circles Packing Problem
نویسندگان
چکیده
Circles packing problem is an NP-hard problem and is difficult to solve. In this paper, a hybrid search strategy for circles packing problem is discussed. A way of generating new configuration is presented by simulating the moving of elastic objects, which can avoid the blindness of simulated annealing search and make iteration process converge fast. Inspired by the life experiences of people, an effective personified strategy to jump out of local minima is given. Based on the simulated annealing idea and personification strategy, an effective personified annealing algorithm for circles packing problem is developed. Numerical experiments on benchmark problem instances show that the proposed algorithm outperforms the best algorithm in the literature.
منابع مشابه
An effective hybrid algorithm for the problem of packing circles into a larger containing circle
Simulated annealing is a powerful stochastic search method, but it still has the disadvantage of blind search. Tabu search (TS) which can prevent cycling and enhance diversi/cation, is an adaptive strategy based on tabu list. By reasonably combining simulated annealing with TS, an e#ective hybrid algorithm for the problem of packing circles into a larger containing circle is presented. Based on...
متن کاملCylinder Packing by Simulated Annealing
This paper is motivated by the problem of loading identical items of circular base (tubes, rolls, ...) into a rectangular base (the pallet). For practical reasons, all the loaded items are considered to have the same height. The resolution of this problem consists in determining the positioning pattern of the circular bases of the items on the rectangular pallet, while maximizing the number of ...
متن کاملDense packing of congruent circles in free-form non-convex containers
This work proposes an algorithm for computing dense packings of congruent circles inside general 2D containers. Unlike the previous approaches which accept as containers, only simple, symmetric shapes such as circles, rectangles and triangles, our method works for any container with a general, freeform (spline) boundary. In contrast to most previous approaches which cast the problem into a non-...
متن کاملExtending Two-Dimensional Bin Packing Problem: Consideration of Priority for Items
In this paper a two-dimensional non-oriented guillotine bin packing problem is studied when items have different priorities. Our objective is to maximize the total profit which is total revenues minus costs of used bins and wasted area. A genetic algorithm is developed to solve this problem where a new coding scheme is introduced. To evaluate the performance of the proposed GA, first an upper b...
متن کاملAn Algorithm for Packing Circles of Two Types in a Fixed Size Container with Non-Euclidean Metric
The paper deals with the problem of optimal packing of two sets of circles (2-D spheres) into a simply connected container. The number of circles is given. The radii of these circles are equal within each set, but, generally speaking, they differ between sets. There are two different statements of a such problem. The simplest one is when the circles of a larger radius are located first, and the...
متن کامل